منابع مشابه
Counting Finite Languages by Total Word Length
We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and asymptotics for large alphabet size and large total word length are discussed. Moreover, we derive a Gaussian limit law for the number of words in a random finite l...
متن کاملUnambiguous 3D measurement from speckle-embedded fringe.
This paper proposes a novel phase-shifting method for fast, accurate, and unambiguous 3D shape measurement. The basic idea is embedding a speckle-like signal in three sinusoidal fringe patterns to eliminate the phase ambiguity, but without reducing the fringe amplitude or frequency. The absolute depth is then recovered through a robust region-wise voting strategy relying on the embedded signal....
متن کاملCounting Fixed-Length Permutation Patterns
We consider the problem of packing fixed-length patterns into a permutation, and develop a connection between the number of large patterns and the number of bonds in a permutation. Improving upon a result of Kaplansky and Wolfowitz, we obtain exact values for the expectation and variance for the number of large patterns in a random permutation. Finally, we are able to generalize the idea of bon...
متن کاملLength measurement by means of a grid.
Experiments were performed which demonstrate some of the length-measuring characteristics of a grid consisting of two sets of parallel lines crossing each other at right angles. If lines of various shapes are repeatedly superimposed at random on such a grid, the mean number of intersections each of these lines makes with the lines of the grid is directly proportional to the length of the line. ...
متن کاملMinimal Path Length of Trees with Known Fringe
In this paper we continue the study of the path length of trees with known fringe as initiated by 1] and 2]. We compute the path length of the minimal tree with given number of leaves N and fringe for the case N=2. This complements the result of 2] that studied the case N=2. Our methods also yields a linear time algorithm for constructing the minimal tree when N=2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society of Precision Engineering
سال: 1958
ISSN: 0374-3543
DOI: 10.2493/jjspe1933.24.125